#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

LL n;
int num[10] = {0};
int bak[10] = {0};

inline void solution() {
    cin >> n;
    string res = to_string(n);
    int len = res.size();
    for (auto & r : res) 
        bak[r - '0'] ++;

    string new = "";
    while (len >= new.size()) {
        n *= 2;
        new = to_string(n);
        bool flag = false;
        for (auto & r : res) {
            num[r - '0'] ++;
            if (num[r - '0'] > bak[r - '0']) flag = true, break;
        }
        for (int i = 0; !flag && i < 10; i ++) {
            if (num[i] != bak[i]) flag = true, break;
        }
        if (!flag) {
            puts("Yes");
            puts(new);
        }
    }

    puts("No");
    puts(new);

}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}
